Unbounded stability of two-term recurrence sequences modulo $2^k$
نویسندگان
چکیده
منابع مشابه
Positivity of Three-Term Recurrence Sequences
In this paper, we give the sufficient conditions for the positivity of recurrence sequences defined by anun = bnun−1 − cnun−2 for n > 2, where an, bn, cn are all nonnegative and linear in n. As applications, we show the positivity of many famous combinatorial sequences.
متن کاملA general two-term recurrence
The recurrence is significant since if we set ai = 0, bi = i for all i we get the Stirling numbers of the second kind, and if we set ai = bi = i for all i we get the Lah numbers. The Lah numbers count the partitions of an n-set into blocks of size k in which the numbers in each block are ordered. The proof in [1] involves generating functions and is rather long. Here we give a short induction p...
متن کاملHigh Speed Modulo Calculation Algorithm with Radix-2k SD Number
In RSA Cryptograms, many modulo calculations are used, but modulo calculation is based on many subtractions and it takes long time to calculate. In this article, we explain about a new modulo calculation algorithm using table. And we proof that upper 3 digits of Radix-2k SD numbers is enough to specify the answer. In the first section, we prepared some useful theorems for operations of Radix-2k...
متن کاملThree term recurrence relation modulo ideal and orthogonality of polynomials of several variables
Orthogonality of polynomials in several variableswith respect to a positiveBorelmeasure supported on an algebraic set is themain theme of this paper.As a step towards this goal quasi-orthogonality with respect to a non-zero Hermitian linear functional is studied in detail; this occupies a substantial part of the paper. Therefore necessary and sufficient conditions for quasi-orthogonality in ter...
متن کاملRecurrence Sequences
Introduction The importance of recurrence sequences hardly needs to be explained. Their study is plainly of intrinsic interest and has been a central part of number theory for many years. Moreover, these sequences appear almost everywhere in mathematics and computer science. For example, the theory of power series representing rational functions [55], pseudo-random number generators ([48], [49]...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Acta Arithmetica
سال: 1996
ISSN: 0065-1036,1730-6264
DOI: 10.4064/aa-74-4-329-346